//Sat Jun  5 20:25:27 CDT 2010
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>

using namespace std;

class ColorfulTilesEasy
{
public:
	int theMin(string room);
};

int ColorfulTilesEasy::theMin(string room)
{
	int N = room.size();
	int count = 0;
	int i = 0, j;
	while (i < N)
	{
		for (j = i + 1; j < N; j++)
		{
			if (room[i] != room[j])
				break;
		}
		count += (j - i) / 2;
		i = j;
	}
	return count;
}
